Data Access With Horn Ontologies: Where Description Logics Meet Existential Rules
نویسندگان
چکیده
منابع مشابه
Combining Existential Rules and Description Logics
Query answering under existential rules — implications with existential quantifiers in the head — is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [Baget et al., 2010; 2011a]. Query answering is also decidable for description logics [Baader, 2003], which further allow disjunction and functionality constraints (assert that certain relations are ...
متن کاملPolynomial Horn Rewritings for Description Logics Ontologies
We study the problem of rewriting an ontology O1 in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with any dataset. After showing undecidability whenever L1 extends ALCF , we focus on devising efficiently checkable conditions that ensure existence of a Horn rewriting. By lifting existing Datalog rewriting techniques for Disjunctive Datalog pro...
متن کاملComputing Horn Rewritings of Description Logics Ontologies
We study the problem of rewriting an ontology O1 expressed in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with an arbitrary dataset. Ontologies that admit such rewritings are amenable to reasoning techniques ensuring tractability in data complexity. After showing undecidability whenever L1 extends ALCF , we focus on devising efficiently chec...
متن کاملCombining description logics and Horn rules with uncertainty in ARTIGENCE
We present ARTIGENCE, a representation language that combines description logics and Horn rules with uncertainty. ARTIGENCE capabilities go beyond the similar hybrid systems presently available, and it contains three components: a highly expressive description logic ACLNR, a set of probabilistic Horn rules and a set of ground facts. The new features described, often required in realistic applic...
متن کاملCombining Existential Rules and Description Logics (Extended Version)
Query answering under existential rules — implications with existential quantifiers in the head — is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [BLM10, BLMS11]. Query answering is also decidable for description logics [Baa03], which further allow disjunction and functionality constraints (assert that certain relations are functions); however...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KI - Künstliche Intelligenz
سال: 2020
ISSN: 0933-1875,1610-1987
DOI: 10.1007/s13218-020-00678-3